Task Parallelism for TwigStack Algorithm on a Multi-core System

نویسندگان

  • Imam MACHDI
  • Toshiyuki AMAGASA
  • Hiroyuki KITAGAWA
چکیده

Abstract The advancement of multi-core processor technology has changed the course of computing and enabled us to maximize the computing performance. In this study, we present an approach of task parallelism for the TwigStack algorithm on a multi-core system to find all occurrences of an XML query twig pattern in a large XML database. The TwigStack agorithm comprises two tasks. The first task is to perform query pattern matching against XML data and to generate partial solutions. Meanwhile, the second task is to merge the partial solutions generated by the first task for final solutions. To achieve query performance improvement, the task parallelism employs the pipeline parallelism technique for the two tasks. The experimental results show that the query performance is significantly improved especially for queries having relatively more complex structures and/or higher selectivities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

متن کامل

Learning Random Forests on the GPU

Random Forests are a popular and powerful machine learning technique, with several fast multi-core CPU implementations. Since many other machine learning methods have seen impressive speedups from GPU implementations, applying GPU acceleration to random forests seems like a natural fit. Previous attempts to use GPUs have relied on coarse-grained task parallelism and have yielded inconclusive or...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Survey on Task Scheduling For Multi- core Systems

In this paper, we review the literature on efficient task scheduling on multi-core system. The number of cores on one chip are increasing very rapidly. For achieving high performance without more power consumption and without heating up the system, multi-core processing technology is used. In addition for fully utilization of system resources in more efficient way task scheduler are developed, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010